TSTP Solution File: NUM793^1 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 10:57:46 EDT 2023

% Result   : Theorem 3.47s 3.67s
% Output   : Proof 3.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM793^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13  % Command    : duper %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Aug 25 15:35:28 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.47/3.67  SZS status Theorem for theBenchmark.p
% 3.47/3.67  SZS output start Proof for theBenchmark.p
% 3.47/3.67  Clause #0 (by assumption #[]): Eq (more x0 y0) True
% 3.47/3.67  Clause #1 (by assumption #[]): Eq (moreis y0 z0) True
% 3.47/3.67  Clause #2 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), less Xx0 Xy0 → more Xy0 Xx0) True
% 3.47/3.67  Clause #3 (by assumption #[]): Eq (∀ (Xx0 Xy0 Xz0 : rat), lessis Xx0 Xy0 → less Xy0 Xz0 → less Xx0 Xz0) True
% 3.47/3.67  Clause #4 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), moreis Xx0 Xy0 → lessis Xy0 Xx0) True
% 3.47/3.67  Clause #5 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), more Xx0 Xy0 → less Xy0 Xx0) True
% 3.47/3.67  Clause #6 (by assumption #[]): Eq (Not (more x0 z0)) True
% 3.47/3.67  Clause #7 (by clausification #[6]): Eq (more x0 z0) False
% 3.47/3.67  Clause #8 (by clausification #[2]): ∀ (a : rat), Eq (∀ (Xy0 : rat), less a Xy0 → more Xy0 a) True
% 3.47/3.67  Clause #9 (by clausification #[8]): ∀ (a a_1 : rat), Eq (less a a_1 → more a_1 a) True
% 3.47/3.67  Clause #10 (by clausification #[9]): ∀ (a a_1 : rat), Or (Eq (less a a_1) False) (Eq (more a_1 a) True)
% 3.47/3.67  Clause #11 (by clausification #[5]): ∀ (a : rat), Eq (∀ (Xy0 : rat), more a Xy0 → less Xy0 a) True
% 3.47/3.67  Clause #12 (by clausification #[11]): ∀ (a a_1 : rat), Eq (more a a_1 → less a_1 a) True
% 3.47/3.67  Clause #13 (by clausification #[12]): ∀ (a a_1 : rat), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.47/3.67  Clause #14 (by superposition #[13, 0]): Or (Eq (less y0 x0) True) (Eq False True)
% 3.47/3.67  Clause #15 (by clausification #[3]): ∀ (a : rat), Eq (∀ (Xy0 Xz0 : rat), lessis a Xy0 → less Xy0 Xz0 → less a Xz0) True
% 3.47/3.67  Clause #16 (by clausification #[15]): ∀ (a a_1 : rat), Eq (∀ (Xz0 : rat), lessis a a_1 → less a_1 Xz0 → less a Xz0) True
% 3.47/3.67  Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : rat), Eq (lessis a a_1 → less a_1 a_2 → less a a_2) True
% 3.47/3.67  Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : rat), Or (Eq (lessis a a_1) False) (Eq (less a_1 a_2 → less a a_2) True)
% 3.47/3.67  Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 : rat), Or (Eq (lessis a a_1) False) (Or (Eq (less a_1 a_2) False) (Eq (less a a_2) True))
% 3.47/3.67  Clause #20 (by clausification #[14]): Eq (less y0 x0) True
% 3.47/3.67  Clause #22 (by clausification #[4]): ∀ (a : rat), Eq (∀ (Xy0 : rat), moreis a Xy0 → lessis Xy0 a) True
% 3.47/3.67  Clause #23 (by clausification #[22]): ∀ (a a_1 : rat), Eq (moreis a a_1 → lessis a_1 a) True
% 3.47/3.67  Clause #24 (by clausification #[23]): ∀ (a a_1 : rat), Or (Eq (moreis a a_1) False) (Eq (lessis a_1 a) True)
% 3.47/3.67  Clause #25 (by superposition #[24, 1]): Or (Eq (lessis z0 y0) True) (Eq False True)
% 3.47/3.67  Clause #26 (by clausification #[25]): Eq (lessis z0 y0) True
% 3.47/3.67  Clause #27 (by superposition #[26, 19]): ∀ (a : rat), Or (Eq True False) (Or (Eq (less y0 a) False) (Eq (less z0 a) True))
% 3.47/3.67  Clause #28 (by clausification #[27]): ∀ (a : rat), Or (Eq (less y0 a) False) (Eq (less z0 a) True)
% 3.47/3.67  Clause #29 (by superposition #[28, 20]): Or (Eq (less z0 x0) True) (Eq False True)
% 3.47/3.67  Clause #30 (by clausification #[29]): Eq (less z0 x0) True
% 3.47/3.67  Clause #31 (by superposition #[30, 10]): Or (Eq True False) (Eq (more x0 z0) True)
% 3.47/3.67  Clause #32 (by clausification #[31]): Eq (more x0 z0) True
% 3.47/3.67  Clause #33 (by superposition #[32, 7]): Eq True False
% 3.47/3.67  Clause #35 (by clausification #[33]): False
% 3.47/3.67  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------